An efficient hypothetical reasoning system for predicate-logic knowledge-base
نویسندگان
چکیده
A hypothetical reasoning system & an important framework in the development of advanced knowledge-based systems. It can be effectively applied to many practical problems including model-based diagnosis, and designs. However, the inference speed of its PROLOG-based implementation is slow, and this is particularly because of inefficient backtracking. In order to overcome this problem, a fast hypothetical reasoning mechanism for propositionallogic knowledge has been developed by combining the advantages of forward and backward reasoning styles. This fast mechanism, however, cannot be applied to hypothetical reasoning with predicate-logic knowledge where variables are included as arguments. The paper presents a fast hypothetical reasoning mechanism for predicate-logic knowledge as an extension of the above idea. A reasoning method developed in the deductive database area is effectively utilized to realize this fast mechanism, which can even manipulate recursive rules.
منابع مشابه
A Predicate-logic Version Method for Cost-based Hypothetical Reasoning Employing an E cient Propositional-level Reasoning Mechanism
For propositional-level hypothetical reasoning (or abduction), particularly for its cost-based variant, some e cient methods have been developed which achieve polynomial-time reasoning (with respect to problem size) to compute a near-optimal solution. However, for predicate-logic version hypothetical reasoning, which allows rich and compact knowledge representation, it seems di cult to nd a met...
متن کاملA Polynomial-Time Predicate-Logic Hypothetical Reasoning by Networked Bubble Propagation Method
Hypothetical reasoning is a useful knowledge-processing framework applicable to many problems including system diagnosis, design, etc. However, due to its non-monotonic inference nature, it takes exponential computation-time to nd a solution hypotheses-set to prove a given goal. This is also true for cost-based hypothetical reasoning to nd an optimal solution with minimal cost. As for the hypot...
متن کاملCOMBINING HYPOTHETICAL REASONING a n d PLAUSIBLE INFERENCE IN POSSIBILISTIC LOGIC*
Possibilistic logic provides an efficient tool for handling uncertain and nonmonotonic reasoning on the one hand, and for hypothetical reasoning on the other hand. In the first situation, logic formulas are simply weighted by lower bounds of a necessity measure. Thus, formulas in a knowledge base are rank-ordered according to their levels of certainty. In the case of hypothetical reasoning, the...
متن کاملKnowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since the most efficient reasoning methods are defined for propositional logic, while knowledge is most conveniently expressed within a first-order language. To obtain compact propositional representations, we employ techni...
متن کاملThe completeness of logic programming with sort predicates
An order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e. a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Knowl.-Based Syst.
دوره 6 شماره
صفحات -
تاریخ انتشار 1991